On omega context free languages which are Borel sets of infinite rank
نویسندگان
چکیده
منابع مشابه
On omega context free languages which are Borel sets of infinite rank
This paper is a continuation of the study of topological properties of omega context free languages (ω-CFL). We proved in [Topological Properties of Omega Context Free Languages, Theoretical Computer Science, Volume 262 (1-2), 2001, p. 669697] that the class of ω-CFL exhausts the finite ranks of the Borel hierarchy, and in [Borel Hierarchy and Omega Context Free Languages, Theoretical Computer ...
متن کاملBorel hierarchy and omega context free languages
We give in this paper additional answers to questions of Lescow and Thomas [Logical Specifications of Infinite Computations, In:”A Decade of Concurrency”, Springer LNCS 803 (1994), 583-621], proving topological properties of omega context free languages (ω-CFL) which extend those of [O. Finkel, Topological Properties of Omega Context Free Languages, Theoretical Computer Science, Vol. 262 (1-2),...
متن کاملBorel Ranks and Wadge Degrees of Context Free omega-Languages
We show that the Borel hierarchy of the class of context free ω-languages, or even of the class of ω-languages accepted by Büchi 1-counter automata, is the same as the Borel hierarchy of the class of ω-languages accepted by Turing machines with a Büchi acceptance condition. In particular, for each recursive non null ordinal α, there exist some Σ α -complete and some Π α -complete ω-languages ac...
متن کاملAn omega-Power of a Finitary Language Which is a Borel Set of Infinite Rank
ω-powers of finitary languages are ω-languages in the form V , where V is a finitary language over a finite alphabet Σ. Since the set Σ of infinite words over Σ can be equipped with the usual Cantor topology, the question of the topological complexity of ω-powers naturally arises and has been raised by Niwinski [Niw90], by Simonnet [Sim92], and by Staiger [Sta97b]. It has been proved in [Fin01]...
متن کاملAn omega-power of a context-free language which is Borel above Delta^0_omega
We use erasers-like basic operations on words to construct a set that is both Borel and above ∆0ω , built as a set V ω where V is a language of finite words accepted by a pushdown automaton. In particular, this gives a first example of an ω-power of a context free language which is a Borel set of infinite rank.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(02)00327-4